Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems
نویسندگان
چکیده
We investigate various language famili$:s which can be obtained from sentential form languages of semi-Thue systems by applying codmgs, weak codings, non-erasing homomorphisms, and arbitrary homomorphi5rns. We also distinguish between monotone, contexi-independent, and context-dependent semi-Thur systems with at most one or finitely many starting words. Finally, we study the effect of erasing productions u -+ A. We obtain complete diagrams which show inclusions and incomparabilitiec of all the language families so defined.
منابع مشابه
INTERVAL-VALUED FUZZY B-ALGEBRAS
In this note the notion of interval-valued fuzzy B-algebras (briefly,i-v fuzzy B-algebras), the level and strong level B-subalgebra is introduced.Then we state and prove some theorems which determine the relationshipbetween these notions and B-subalgebras. The images and inverse images ofi-v fuzzy B-subalgebras are defined, and how the homomorphic images andinverse images of i-v fuzzy B-subalge...
متن کاملA Framework for Hybrid Planning
Hybrid models are characterised by the integration of two (or more) different paradigms of representation within the same system. Most current planning problem description languages are purely sentential, i.e., based on predicate logic formalisms [3, 14]. The ramification of the effects of action [16] makes the sentential description of planning problems that involve the spatial movement of phy...
متن کاملSome Power-Decreasing Derivation Restrictions in Grammar Systems
In this paper, we place some left restrictions on derivations in CD grammar systems with phrase-structure grammars, controlled by the regular languages. The first restriction requires that every production is always applied within the first k nonterminals in every sentential form, for some k ≥ 1. The second restriction says how many blocks of non-terminals can be in each sentential form. The th...
متن کاملElements of Finite Order for Finite Monadic Church-rosser True Systems
A Thue system T over ~ is said to allow nontrivial elements of finite order, if there exist a word u E ~* and integers n ;;. 0 and k ;;. 1 such that u .... fA and u,,+k .... f u". Here the following decision problem is shown to be decidable: Instance. A finite, monadic, Church-Rosser Thue system Tover~. Question. Does T allow nontrivial elements of finite order? By a result of Muller and Schupp...
متن کاملOn One-Rule Grid Semi-Thue Systems
The family of one-rule grid semi-Thue systems, introduced by Alfons Geser, is the family of one-rule semi-Thue systems such that there exists a letter c that occurs as often in the left-hand side as the right-hand side of the rewriting rule. We prove that for any one-rule grid semi-Thue system S, the set S(w) of all words obtainable from w using repeatedly the rewriting rule of S is a construct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 33 شماره
صفحات -
تاریخ انتشار 1984